Tiling Problems
ثبت نشده
چکیده
The undecidable problems we saw at the start of our unit on undecidability were all questions about the behavior of computer programs. But in fact there are many decision problems which, on the surface, have nothing to do with computer programs yet can still be proved to have no algorithmic solution. One of these is a tiling problem. Imagine square tiles divided into colored triangular quadrants.
منابع مشابه
Polygonal tiling of some surfaces containing fullerene molecules
A tiling of a surface is a decomposition of the surface into pieces, i.e. tiles, which cover it without gaps or overlaps. In this paper some special polygonal tiling of sphere, ellipsoid, cylinder, and torus as the most abundant shapes of fullerenes are investigated.
متن کاملThe Complexity of Domino Tiling Problems
In this paper, we give a combinatorial formalization that describes a wide range of related problems in the theory of tiling derived from the popular game of dominos. We show that determining if a given finite region of the plane can be tiled with a given set of dominos is NP-Complete. The new graph theoretical methods we introduce allow this result to be easily generalized to a variety of simi...
متن کاملTiling with Small Tiles
We look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can help solve other tiling problems – we give an example of this. We also present a result to a more classic tiling question with dominoes and L-shape tiles.
متن کاملReport On Cobweb Posets' Tiling Problem
Responding to Kwaśniewski’s cobweb posets’ problems posed in [3, 4] we present here some results on one of them namely on Cobweb Tiling Problem. Kwaśniewski cobweb posets with tiling property are designated-coded by their correspondent tiling sequences. We show that the family of all cobweb tiling sequences includes Natural numbers, Fibonacci numbers, Gaussian integers and show that there are m...
متن کاملOn Cobweb posets tiling problem
Kwaśniewski’s cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in the source papers and it entailes natural enquieres already formulated therein. In our note we response to one of those problems. This is a tili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007